Lattices in Computer Science Lecture 1 Introduction Lecturer : Oded Regev
نویسنده
چکیده
In this course we will consider mathematical objects known as lattices. What is a lattice? It is a set of points in n-dimensional space with a periodic structure, such as the one illustrated in Figure 1. Three dimensional lattices occur naturally in crystals, as well as in stacks of oranges. Historically, lattices were investigated since the late 18th century by mathematicians such as Lagrange, Gauss, and later Minkowski.
منابع مشابه
Lattices in Computer Science Lecture 8 Dual Lattices Lecturer : Oded Regev Scribe : Gillat Kol
From the above definition, we have the following geometrical interpretation of the dual lattice. For any vector x, the set of all points whose inner product with x is integer forms a set of hyperplanes perpendicular to x and separated by distance 1/‖x‖. Hence, any vector x in a lattice Λ imposes the constraint that all points in Λ∗ lie in one of the hyperplanes defined by x. See the next figure...
متن کاملLattices in Computer Science Lecture 2 LLL Algorithm
Lattices in Computer Science Lecture 2 LLL Algorithm Lecturer: Oded Regev Scribe: Eyal Kaplan In this lecture1 we describe an approximation algorithm to the Shortest Vector Problem (SVP). This algorithm, developed in 1982 by A. K. Lenstra, H. W. Lenstra, Jr. and L. Lovasz, usually called the LLL algorithm, gives a ( 2 √ 3 ) n approximation ratio, where n is the dimension of the lattice. In many...
متن کاملLattices in Computer Science Lecture 5 Some basic complexity results
Recall that in the closest vector problem we are given a lattice and a target vector (which is usually not in the lattice) and we are supposed to find the lattice point that is closest to the target point. More precisely, one can consider three variants of the CVP, depending on whether we have to actually find the closest vector, find its distance, or only decide if it is closer than some given...
متن کاملCOS 598 D - Lattices scribe : Srdjan Krstic
The first two sections are largely based on the first two lectures by Oded Regev, course ”Lattices in Computer Science, Fall 2004. The third part is somewhat based on the paper by Oded Regev and Daniele Micciancio Worst-case to Average-case Reductions based on Gaussian Measures, SIAM Journal on Computing 37(1) pp. 267-302, 2007. and to a larger extent on the paper by O. Goldreich, S. Goldwasser...
متن کاملLattices in Computer Science Lecture 3 CVP Algorithm
In this lecture, we describe an approximation algorithm to the Closest Vector Problem (CVP). This algorithm, known as the Nearest Plane Algorithm, was developed by L. Babai in 1986. It obtains a 2( 2 √ 3 ) approximation ratio, where n is the rank of the lattice. In many applications, this algorithm is applied for a constant n; in such cases, we obtain a constant approximation factor. One can de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006